A Note on Triple Repetition Sequence of Domination Number in Graphs
نویسندگان
چکیده
A set D subset of V(G) is a dominating graph G if for all x ϵ V(G)\D, some y such that xy E(G). called connected the subgraph <D> induced by connected. domination number G, denoted γ_c(G), minimum cardinality D. The triple repetition sequence {S_n:n Z+} positive integers which repeated thrice, i.e., {S_n}={1,1,1,2,2,2,3,3,3, ...}. In this paper, we construct combinatorial explicit formula numbers triangular grid graph.Keywords: number; graph; sequence. AbstrakSuatu himpunan subhimpunan dari adalah pendominasi graf apabila untuk semua suatu sehingga Suatu dikatakan terhubung subgraf yang diinduksi oleh terhubung. bilangan dinotasikan dengan kardinalitas Barisan pengulangan rangkap tiga barisan bulat positif setiap sukunya berulang kali, yakni, Dalam paper ini dikonstruksi rumus eksplisit kombinatorial triangular.Kata Kunci: terhubung; triangular; tiga. 2020MSC: 05C69
منابع مشابه
On the super domination number of graphs
The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...
متن کاملTotal Roman domination subdivision number in graphs
A {em Roman dominating function} on a graph $G$ is a function $f:V(G)rightarrow {0,1,2}$ satisfying the condition that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$. A {em total Roman dominating function} is a Roman dominating function with the additional property that the subgraph of $G$ induced by the set of all vertices of positive weight has n...
متن کاملDomination and Signed Domination Number of Cayley Graphs
In this paper, we investigate domination number as well as signed domination numbers of Cay(G : S) for all cyclic group G of order n, where n in {p^m; pq} and S = { a^i : i in B(1; n)}. We also introduce some families of connected regular graphs gamma such that gamma_S(Gamma) in {2,3,4,5 }.
متن کاملA note on domination in bipartite graphs
DOMINATING SET remains NP -complete even when instances are restricted to bipartite graphs, however, in this case VERTEX COVER is solvable in polynomial time. Consequences to VECTOR DOMINATING SET as a generalization of both are discussed.
متن کاملA note on domination and independence-domination numbers of graphs∗
Vizing’s conjecture is true for graphs G satisfying γ(G) = γ(G), where γ(G) is the domination number of a graph G and γ(G) is the independence-domination number of G, that is, the maximum, over all independent sets I in G, of the minimum number of vertices needed to dominate I . The equality γ(G) = γ(G) is known to hold for all chordal graphs and for chordless cycles of length 0 (mod 3). We pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: InPrime Journal
سال: 2022
ISSN: ['2716-2478']
DOI: https://doi.org/10.15408/inprime.v4i2.24573